Core-generating approximate minimum entropy discretization for rough set feature selection in pattern classification
نویسندگان
چکیده
منابع مشابه
Rough Set Feature Selection Algorithms for Textual Case-Based Classification
Feature selection algorithms can reduce the high dimensionality of textual cases and increase case-based task performance. However, conventional algorithms (e.g., information gain) are computationally expensive. We previously showed that, on one dataset, a rough set feature selection algorithm can reduce computational complexity without sacrificing task performance. Here we test the generality ...
متن کاملSentiment Classification using Rough Set based Hybrid Feature Selection
Sentiment analysis means to extract opinion of users from review documents. Sentiment classification using Machine Learning (ML) methods faces the problem of high dimensionality of feature vector. Therefore, a feature selection method is required to eliminate the irrelevant and noisy features from the feature vector for efficient working of ML algorithms. Rough Set Theory based feature selectio...
متن کاملRough Set Extensions for Feature Selection
Rough set theory (RST) was proposed as a mathematical tool to deal with the analysis of imprecise, uncertain or incomplete information or knowledge. It is of fundamental importance to artificial intelligence particularly in the areas of knowledge discovery, machine learning, decision support systems, and inductive reasoning. At the heart of RST is the idea of only employing the information cont...
متن کاملFuzzy discretization of feature space for a rough set classifier
A concept of fuzzy discretization of feature space for a rough set theoretic classifier is explained. Fuzzy discretization is characterised by membership value, group number and affinity corresponding to an attribute value, unlike crisp discretization which is characterised only by the group number. The merit of this approach over both crisp discretization in terms of classification accuracy, i...
متن کاملClustering Using Rough - Set Feature Selection
`Feature selection aims to remove features unnecessary to the target concept. Rough-set theory (RST) eliminates unimportant or irrelevant features, thus generating a smaller (than the original) set of attributes with the same, or close to, classificatory power. Clustering, also a form of data grouping, groups a set of data such that intra-cluster similarity is maximized and inter-cluster simila...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2011
ISSN: 0888-613X
DOI: 10.1016/j.ijar.2011.03.001